Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
نویسندگان
چکیده
Abstract We present a polynomial-time Markov chain Monte Carlo algorithm for estimating the partition function of antiferromagnetic Ising model on any line graph. The analysis exploits ‘winding’ technology devised by McQuillan [CoRR abs/1301.2880 (2013)] and developed Huang, Lu Zhang [Proc. 27th Symp. Disc. Algorithms (SODA16), 514–527]. show that exact computation is #P-hard, even graphs, indicating an approximation best can be expected. also Glauber dynamics rapidly mixing example being kagome lattice.
منابع مشابه
Polynomial-Time Approximation Algorithms for the Ising Model
The paper presents a randomised algorithm which evaluates the partition function of an arbitrary ferromagnetic Ising system to any speci ed degree of accuracy. The running time of the algorithm increases only polynomially with the size of the system (i.e., the number of sites) and a parameter which controls the accuracy of the result. Further approximation algorithms are presented for the mean ...
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملOn the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs
The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halld orsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a wo...
متن کاملPolynomial Time Approximation Algorithms for Localization Based on Unknown Signals
We consider the problem of anchor-free self-calibration of receiver locations using only the reception time of signals produced at unknown locations and time points. In our settings the receivers are synchronized, so the time differences of arrival (TDOA) of the signals arriving at the receivers can be calculated. Given the set of distinguishable time points for all receivers the task is to det...
متن کاملApproximation Algorithms for Polynomial-Expansion and Low-Density Graphs
We investigate the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs, and it is a subset of the family of graphs that have polynomial expansion. We present efficient (1 + ε)-approximation algorithms for polynomial expansion graphs, for Independent Set, Set Cover, and Dominating Set problems, among ot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability & Computing
سال: 2021
ISSN: ['0963-5483', '1469-2163']
DOI: https://doi.org/10.1017/s0963548321000080